Professor | Office | |
K. Raven Russell | krusselc | ENGR 5328 |
For All Classes:
For Online and Hybrid Classes:
Analyzes computational resources for important problem types by alternative algorithms and their associated data structures, using mathematically rigorous techniques. Specific algorithms analyzed and improved.
Tentative topics to be covered include:
See the schedule (on Piazza) for a more detailed topics list.
Formal Prerequisites: C or better in: CS310, CS330, and Math 125.
More generally, you will be using knowledge introduced in a Formal Methods and Models course (such as CS 330) and by entension Discrete Mathematics (in Math 125). You also need knowledge gained from a Data Structures course (such as CS 310) and by extension multiple programming courses (such as CS 112 and CS 211).
Below is a more detailed (but not exhaustive) list of topics which may "come back to haunt you":
At the end of the course, students will be able to:
Category | Sub-Category | Percent |
Homework | Non-Code (5) | 15% |
Mini-Code (4) | 10% | |
Code (2) | 10% | |
Exams | Midterm | 30% |
Final | 35% | |
Extra Credit Opportunities |
EC HW 12 | +1% |
EC on Exams | +3.25% |
The following will be applied without rounding:
There will be no make-up assignments or unannounced extra-credit opportunities at the end of the semester; your grade should be a measure of your semester-long progress.